TiAl基合金板材制备技术的发展现状

综述了TiAl基合金板材制备技术的发展现状。介绍了的制备TiAl基合金板材三种技术的工艺过程及制得的TiAl基合金板材的显微组织和力学性能。     

Immobilization and activation of vanadium(III) and titanium(III) single‐site catalysts for ethylene polymerization using MgCl2‐based supports

Significant increases in the activity of vanadium(III) amidinate catalysts for ethylene polymerization have been obtained by immobilization on a MgCl₂‐based support prepared by reaction of AlEt₃ with a MgCl₂/ethanol adduct. Catalyst immobilization and activation on this type of support prevents the rapid decay in activity observed under homogeneous polymerization conditions with unsupported catalysts. Stable polymerization activity is also observed with analogous titanium(III) complexes. Polyethylene with narrow molecular weight distribution and spherical particle morphology is obtained without reactor fouling. Copyright © 2005 Society of Chemical Industry     

Knowledge representation for mathematical discovery: Three experiments in graph theory

This paper describes the nature of mathematical discovery (including concept definition and exploration, example generation, and theorem conjecture and proof), and considers how such an intelligent process can be simulated by a machine. Although the material is drawn primarily from graph theory, the results are immediately relevant to research in mathematical discovery and learning.The thought experiment, a protocol paradigm for the empirical study of mathematical discovery, highlights behavioral objectives for machine simulation. This thought experiment provides an insightful account of the discovery process, motivates a framework for describing mathematical knowledge in terms of object classes, and is a rich source of advice on the design of a system to perform discovery in graph theory. The evaluation criteria for a discovery system, it is argued, must include both a set of behavior to display (behavioral objectives) and a target set of facts to be discovered (factual knowledge).Cues from the thought experiment are used to formulate two hierarchies of representational languages for graphy theory. The first hierarchy is based on the superficial terminology and knowledge of the thought experiment. Generated by formal grammars with set-theoretic semantics, this eminently reasonable approach ultimately fails to meet the factual knowledge criteria. The second hierarchy uses declarative expressions, each of which has a semantic interpretation as a stylized, recursive algorithm that defines a class by generating it correctly and completely. A simple version of one such representation is validated by a successful, implemented system called Graph Theorist (GT) for mathematical research in graph theory. GT generates correct examples, defines and explores new graph theory properties, and conjectures and proves theorems.Several themes run through this paper. The first is the dual goals, behavioral objectives and factural knowledge to be discovered, and the multiplicity of their demands on a discovery system. The second theme is the central role of object classes to knowledge representation. The third is the increased power and flexibility of a constructive (generator) definition over the more traditional predicate (tester) definition. The final theme is the importance of examples and recursion in mathematical knowledge. The results provide important guidance for further research in the simulation of mathematical discovery.     

A flexible architecture for distributed knowledge based systems with nomadic access through handheld devices

Nowadays any Knowledge Based System (KBS) realization needs of intercommunication among distributed components and to use non-connected and distributed data sources, which poses several challenges to the classical Artificial Intelligence field of KBS.

The multiagent paradigm and the use of ontologies are considered to be suitable tools to face the problems of designing and developing today KBS. On the other hand, using such networked KBS through handheld devices makes more efficient exploitation and interaction with the system.

This paper presents an open and flexible architecture for a distributed KBS and an application of it to construct a system for Psychological Disorders consulting, the so called PDA² (Psychological Disorder Assistant through PDA). We analyze the main features of the architecture as well as the agent tools we may use to construct it. Additionally, we present a support ontology for Psychological Disorders.     

A stochastic realization algorithm via block LQ decomposition in Hilbert space

A stochastic realization problem of a stationary stochastic process is re-visited, and a new stochastically balanced realization algorithm is derived in a Hilbert space generated by second-order stationary processes. The present algorithm computes a stochastically balanced realization by means of the singular value decomposition of a weighted block Hankel matrix derived by a “block LQ decomposition”. Extension to a stochastic subspace identification method explains how the proposed abstract algorithm is implemented in system identification.     

抗窄带干扰宽带中频数字接收机的设计与实现

讨论了存在强干扰条件下MSK中频数字接收机的频域窄带干扰抑制、伪码快速捕获、MSK相干解调等实现方法。具体实现中提出了基于功率估计的码捕获门限实时调整方案，解决了动态干扰条件下的快速码捕获问题。基于FPGA DSP硬件设计和软件可编程数字信号处理算法，接收机具有较强的适应性和稳定性。     

A note on the variance of rank-based selection strategies for genetic algorithms and genetic programming

This paper evaluates different forms of rank-based selection that are used with genetic algorithms and genetic programming. Many types of rank based selection have exactly the same expected value in terms of the sampling rate allocated to each member of the population. However, the variance associated with that sampling rate can vary depending on how selection is implemented. We examine two forms of tournament selection and compare these to linear rank-based selection using an explicit formula. Because selective pressure has a direct impact on population diversity, we also examine the interaction between selective pressure and different mutation strategies.     

Representing temporal knowledge in conceptual graphs

This study was motivated by some difficulties encountered by the authors when trying to express temporal knowledge using Sowa's conceptual graph (CG) approach. An overview of Sowa's approach is given and the difficulties encountered when trying to model temporal knowledge are outlined: the disparity of notations allowed by CG theory for expressing temporal information; the ambiguity and incompleteness of tense sspecification; the difficulty of harmonizing tenses and intergraph temporal relations. Various approaches suggested for representing time both in artificial intelligence and linguistics are presented, and an extension to Sowa's approach is proposed in which temporal and nontemporal knowledge are differentiated. In this model points in time are represented as well as time intervals. A semantic interpretation of verbs is provided based on an extension of Reichenbach's model of temporal markers. The authors show how their approach enables the representation of tenses as well as the aspectual properties of natural language sentences.     

TiAl基合金表面改性对高温抗氧化性的影响

研究了渗碳处理ＴｉＡｌ基合金试样的高温氧化行为，发现渗碳处理可以在ＴｉＡｌ基合金试样表层形成致密的多层结构的渗碳层，并发生表层Ａｌ、Ｔｉ重新分配。致密的渗碳层具有良好的高温抗氧化性和高温热稳定性，同时，Ｔｉ、Ａｌ重新分配形成的富Ａｌ最外层也能进一步提高合金的抗氧化性。